Fine-Grained Crowd Counting

نویسندگان

چکیده

Current crowd counting algorithms are only concerned about the number of people in an image, which lacks low-level fine-grained information crowd. For many practical applications, total image is not as useful each sub-category. example, knowing waiting inline or browsing can help retail stores; standing/sitting restaurants/cafeterias; violent/non-violent police management. In this article, we propose counting, differentiates a into categories based on behavior attributes individuals (e.g. violent behavior) and then counts category. To enable research area, construct new dataset four real-world tasks: traveling direction sidewalk, standing sitting, line not, exhibiting not. Since appearance features different similar, challenge to effectively utilize contextual distinguish between categories. We two branch architecture, consisting density map estimation semantic segmentation branch. refinement strategies for improving predictions branches. First, encode information, feature propagation guided by prediction, eliminates effect background during propagation. Second, complementary attention model share Experiment results confirm effectiveness our method.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fine-Grained Probability Counting: Refined LogLog Algorithm

Estimating the number of distinct flows, also called the cardinality, is an important issue in many network applications, such as traffic measurement, anomaly detection, etc. The challenging problem is that a high accuracy should be achieved with line speed and small auxiliary memory. The state-of-the-art, LogLog algorithm, uses loglogNmax memory, where Nmax is the priori upper bound for cardin...

متن کامل

Fine-grained reductions from approximate counting to decision

The main problems in fine-grained complexity are CNF-SAT, the Orthogonal Vectors problem, 3SUM, and the Negative-Weight Triangle problem (which is closely related to All-Pairs Shortest Path). In this paper, we consider the approximate counting version of each problem; thus instead of simply deciding whether a witness exists, we attempt to (multiplicatively) approximate the number of witnesses. ...

متن کامل

Ultra-Fine Grained Dual-Phase Steels

This paper provides an overview on obtaining low-carbon ultra-fine grained dual-phase steels through rapid intercritical annealing of cold-rolled sheet as improved materials for automotive applications. A laboratory processing route was designed that involves cold-rolling of a tempered martensite structure followed by a second tempering step to produce a fine grained aggregate of ferrite and ca...

متن کامل

Unsupervised Crowd Counting

Most crowd counting methods rely on training with labeled data to learn a mapping between image features and the number of people in the scene. However, the nature of this mapping may change as a function of the scene, camera parameters, illumination etc., limiting the ability of such supervised systems to generalize to novel conditions. Here we propose an alternative, unsupervised strategy. Th...

متن کامل

Counting with the Crowd

In this paper, we address the problem of selectivity estimation in a crowdsourced database. Specifically, we develop several techniques for using workers on a crowdsourcing platform like Amazon’s Mechanical Turk to estimate the fraction of items in a dataset (e.g., a collection of photos) that satisfy some property or predicate (e.g., photos of trees). We do this without explicitly iterating th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE transactions on image processing

سال: 2021

ISSN: ['1057-7149', '1941-0042']

DOI: https://doi.org/10.1109/tip.2021.3049938